Programming Language Theory and Its Implementation

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Programming language theory and its implementation - applicative and imperative paradigms

ions The description of the meaning of expressions just given above is vague and intuitive It took about years for logicians Dana Scott in fact to make it rigorous in a useful way We shall not be going into details of this Example x x denotes the identity function x x E E Example x f f x denotes the function which when applied to E yields f f x E x i e f f E This is the function which when appl...

متن کامل

nition Language and Its Implementation

Universal graphical editor de nition language based on logical metamodel extended by presentation classes is proposed. Implementation principles of this language, based on Graphical Diagramming Engine are described.

متن کامل

Interaction nets: programming language design and implementation

This paper presents a compiler for interaction nets, which, just like term rewriting systems, are user-definable rewrite systems which offer the ability to specify and program. In the same way that the λ -calculus is the foundation for functional programming, or horn clauses are the foundation for logic programming, we give in this paper an overview of a substantial software system that is curr...

متن کامل

Abstract machines for programming language implementation

machines for programming language implementation Stephan Diehl a,∗, Pieter Hartel b, Peter Sestoft c a FB-14 Informatik, Universität des Saarlandes, Postfach 15 11 50, 66041 Saarbrücken, Germany b Department of Electronics and Computer Science, University of Southampton, Highfield, Southampton SO17 1BJ, UK c Department of Mathematics and Physics, Royal Veterinary and Agricultural University, Th...

متن کامل

Automatic Implementation of Programming Language Consistency Models

Concurrent threads of execution running on a shared memory system can access the same memory locations. A consistency model defines constraints on the order of these shared memory accesses. For good run-time performance, these constraints must be as few as possible. Programmers who write explicitly parallel programs must take into account the consistency model when reasoning about the behavior ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Science of Computer Programming

سال: 1989

ISSN: 0167-6423

DOI: 10.1016/0167-6423(89)90019-1